Completeness of temporal logics over infinite intervals
نویسندگان
چکیده
Interval Temporal Logics over infinite intervals are studied. First, the ordinary possible worlds models are extended to infinite possible world models. Accordingly, an axiomatic system is proposed and it has been proved complete. Secondly, infinite intervals are included in a logic over abstract intervals. A corresponding axiomatic system is given and proven to be complete also.
منابع مشابه
Completeness for Logics on Finite Traces
Temporal logics over finite traces are not the same as temporal logics over potentially infinite traces. We propose that existing methods for proving deductive completeness for infinite-trace logics are effective on their finite counterparts. To adapt proofs for infinite-trace logics, we “inject” finiteness: that is, we alter the proof structure to ensure that models are finite. As evidence for...
متن کاملA Hierarchical Completeness Proof for Interval Temporal Logic with Finite Time (Preliminary Version)
Logics based on regular languages over finite words and ω-words offer a promising but elusive framework for formal specification and verification. Starting with the seminal work of Büchi [5,6] and Elgot [11] around 1960, a number of such logics and decision procedures have been proposed. In addition, various researchers have obtained complete axiom systems by embedding and expressing the decisi...
متن کاملA Complete Axiom System for Propositional Interval Temporal Logic with Infinite Time
Interval Temporal Logic (ITL) is an established temporal formalism for reasoning about time periods. For over 25 years, it has been applied in a number of ways and several ITL variants, axiom systems and tools have been investigated. We solve the longstanding open problem of finding a complete axiom system for basic quantifier-free propositional ITL (PITL) with infinite time for analysing nonte...
متن کاملInterval Temporal Logics over Finite Linear Orders: the Complete Picture
Interval temporal logics provide a natural framework for temporal reasoning about interval structures over linearly ordered domains, where intervals are taken as the primitive ontological entities. In this paper, we identify all fragments of Halpern and Shoham’s interval temporal logic HS whose finite satisfiability problem is decidable. We classify them in terms of both relative expressive pow...
متن کاملProbabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems
The paper presents probabilistic extensions of interval temporal logic (ITL) and duration calculus (DC ) with infinite intervals and complete Hilbert-style proof systems for them. The completeness results are a strong completeness theorem for the system of probabilistic ITL with respect to an abstract semantics and a relative completeness theorem for the system of probabilistic DC with respect ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 136 شماره
صفحات -
تاریخ انتشار 2004